ar X iv : q ua nt - p h / 02 11 09 1 v 4 1 6 Se p 20 13 Hidden Translation and Translating Coset in Quantum Computing ∗
نویسندگان
چکیده
We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in Zp , whenever p is a fixed prime. For the induction step, we introduce the problem Translating Coset generalizing both Hidden Translation and Hidden Subgroup, and prove a powerful self-reducibility result: Translating Coset in a finite solvable group G is reducible to instances of Translating Coset in G/N and N , for appropriate normal subgroups N of G. Our self-reducibility framework combined with Kuperberg’s subexponential quantum algorithm for solving Hidden Translation in any abelian group, leads to subexponential quantum algorithms for Hidden Translation and Hidden Subgroup in any solvable group.
منابع مشابه
ar X iv : q ua nt - p h / 02 11 09 1 v 1 1 5 N ov 2 00 2 Hidden Translation and Orbit Coset in Quantum Computing ∗
We give efficient quantum algorithms for HIDDEN TRANSLATION and HIDDEN SUBGROUP in a large class of non-abelian groups including solvable groups of bounded exponent and of bounded derived series. Our algorithms are recursive. For the base case, we solve efficiently HIDDEN TRANSLATION in Z p , whenever p is a fixed prime. For the induction step, we introduce the problem ORBIT COSET generalizing ...
متن کاملar X iv : q ua nt - p h / 02 06 11 6 v 1 1 8 Ju n 20 02 Five Lectures On Dissipative Master Equations
متن کامل
ar X iv : q ua nt - p h / 06 09 12 6 v 1 1 7 Se p 20 06 SU ( 2 ) Relativity and the EPR Paradox
In the normal presentation of the EPR problem a comparison is made between the (weak) Copenhagen interpretation of quantum mechanics which seems to suggest that at times action at a distance may take place, and the hidden parameter interpretation which must satisfy Bell’s inequality, in contradiction to the predictions of quantum mechanics. In this paper, we consider a relativistic approach to ...
متن کاملar X iv : q ua nt - p h / 03 04 09 0 v 4 1 9 Ju n 20 06 HIDDEN SYMMETRY DETECTION ON A QUANTUM COMPUTER
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with f (U [x]) = f (x). Following a discussion regarding which tasks might be solved efficiently by quantum computers, it will be demonstrated by means of a simple example, that the detection of more general hidden (two-point) symmetries V {f (x...
متن کاملar X iv : q ua nt - p h / 05 09 19 4 v 1 2 8 Se p 20 05 Nonlocality without inequalities ∗
We prove that every conceivable hidden variable model reproducing the quantum mechanical predictions of almost any entangled state must necessarily violate Bell’s locality condition. The proof does not involve the consideration of any Bell inequality but it rests on simple set theoretic arguments and it works for almost any noncompletely factorizable state vector associated to any number of par...
متن کامل